Regularity of optimal transport maps and partial differential inclusions
نویسندگان
چکیده
In this paper we deal with the regularity of planar optimal transport maps, in a “critical” case not covered presently in the literature. Following a suggestion by J.Maly, and the ideas in [1], we relate the regularity problem to a “rigidity” problem for partial differential inclusions which might be interesting in its own right. Let us start with the first problem. We give a formulation in terms of subdifferentials (i.e. cyclically monotone operators), deferring the relations with optimal transport theory to Section 6. Problem 1. Let u : R → P (R) be a subdifferential, A ⊂ Dom(u) open, and let us assume that 1 L L 2 A ≤ Ju A ≤ LL 2 A.
منابع مشابه
Partial Regularity for Optimal Transport Maps
We prove that, for general cost functions on R, or for the cost d/2 on a Riemannian manifold, optimal transport maps between smooth densities are always smooth outside a closed singular set of measure zero.
متن کاملPartial Regularity Results in Optimal Transportation
This note describes some recent results on the regularity of optimal transport maps. As we shall see, in general optimal maps are not globally smooth, but they are so outside a “singular set” of measure zero. 1. The optimal transportation problem The optimal transportation problem, whose origin dates back to Monge [19], aims to find a way to transport a distribution of mass from one place to an...
متن کاملExterior Sphere Condition and Time Optimal Control for Differential Inclusions
The minimum time function T (·) of smooth control systems is known to be locally semiconcave provided Petrov’s controllability condition is satisfied. Moreover, such a regularity holds up to the boundary of the target under an inner ball assumption. We generalize this analysis to differential inclusions, replacing the above hypotheses with the continuity of T (·) near the target, and an inner b...
متن کاملTwo Views on Optimal Transport and Its Numerical Solution
We present two insights into certain optimal transportation problems that are accompanied by new approaches to the numerical solution of these problems. First, we show that Monge’s optimal transport problem with quadratic cost can be reformulated as an infinite-dimensional convex optimization problem under certain conditions, most importantly that the target measure has a log-concave density. W...
متن کاملMax - Planck - Institut für Mathematik in den Naturwissenschaften Leipzig Representation of Markov chains by random
We systematically investigate the problem of representing Markov chains by families of random maps, and what regularity of these maps can be achieved depending on the properties of the probability measures. Our key idea is to use techniques from optimal transport to select optimal such maps. Optimal transport theory also tells us how convexity properties of the supports of the measures translat...
متن کامل